Non-interactive and Re-usable Universally Composable String Commitments with Adaptive Security
نویسندگان
چکیده
We present the first provably secure constructions of universally composable (UC) commitments (in pairing-friendly groups) that simultaneously combine the key properties of being non-interactive, supporting commitments to strings (instead of bits only), and offering reusability of the common reference string for multiple commitments. Our schemes are also adaptively secure assuming reliable erasures.
منابع مشابه
All-But-Many Encryption - A New Framework for Fully-Equipped UC Commitments
We present a general framework for constructing non-interactive universally composable (UC) commitment schemes that are secure against adaptive adversaries in the non-erasure model under a re-usable common reference string. Previously, such “fully-equipped” UC commitment schemes have been known only in [CF01,CLOS02], with strict expansion factor O(κ); meaning that to commit λ bits, communicatio...
متن کاملHighly-Efficient Universally-Composable Commitments Based on the DDH Assumption
Universal composability (or UC security) provides very strong security guarantees for protocols that run in complex real-world environments. In particular, security is guaranteed to hold when the protocol is run concurrently many times with other secure and possibly insecure protocols. Commitment schemes are a basic building block in many cryptographic constructions, and as such universally com...
متن کاملA Framework for Efficient Fully-Equipped UC Commitments
We present a general framework for constructing non-interactive universally composable (UC) commitmentschemes that are secure against adaptive adversaries in the non-erasure setting under a single re-usable commonreference string. Previously, such “fully-equipped” UC commitment schemes are only known in [8, 9], with anunavoidable overhead of O(κ) in the sense of communication and co...
متن کاملUniversally Composable Commitments Using Random Oracles
In the setting of universal composability [Can01], commitments cannot be implemented without additional assumptions such as that of a publicly available common reference string [CF01]. Here, as an alternative to the commitments in the common reference string model, the use of random oracles to achieve universal composability of commitment protocols is motivated. Special emphasis is put on the s...
متن کاملUniversally Composable Commitments
We propose a new security measure for commitment protocols, called Universally Composable (UC) Commitment. The measure guarantees that commitment protocols behave like an “ideal commitment service,” even when concurrently composed with an arbitrary set of protocols. This is a strong guarantee: it implies that security is maintained even when an unbounded number of copies of the scheme are runni...
متن کامل